Extrapolation vs. projection methods for linear systems of equations
نویسندگان
چکیده
منابع مشابه
Extrapolation vs. projection methods for linear systems of equations
It is shown that the four vector extrapolation methods, minimal polynomial extrapolation, reduced rank extrapolation, modified minimal polynomial extrapolation, and topological epsilon algorithm, when applied to linearly generated vector sequences, are Krylov subspace methods, and are equivalent to some well known conjugate gradient type methods. A unified recursive method that includes the con...
متن کاملI t 1 EXTRAPOLATION vs PROJECTION METHODS FOR LINEAR SYSTEJ
It is ,shown that the four, vectof extrapolation methods. minimal polynomial extrapolation. reduced rank extrapolation. modified minimal polynomial extrapolation. and topological epsilon algorithm. when appiied to linearly generated vector sequences. are Krylov subspace methods. and· a~ equivalent to some well known conjugate gradient type methods., A unified recursive method thaJ includes the ...
متن کاملProjection Methods for Linear Systems
The aim of this paper is to give a uniied framework for deriving projection methods for solving systems of linear equations. We shall show that all these methods follow from a unique minimization problem. The particular cases of the methods of steepest descent, Richardson and conjugate gradients will be treated in details. Projection acceleration procedures for accelerating the convergence of a...
متن کاملAnalysis of Some Vector Extrapolation Methods for Solving Systems of Linear Equations
In this paper, we consider some vector extrapolation methods for solving nonsymmetric systems of linear equations. When applied to sequences generated linearly, these methods namely the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE), are Krylov subspaces methods and are respectively equivalent to the method of Arnoldi and to the GCR and GMRES. By considering the...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1988
ISSN: 0377-0427
DOI: 10.1016/0377-0427(88)90289-0